A multi-objective model for facility location-allocation problem with immobile servers within queuing framework

نویسندگان

  • Seyed Habib A. Rahmati
  • Abbas Ahmadi
  • Mani Sharifi
  • Amirhossain Chambari
چکیده

This research investigates a practical bi-objective model for the facility location–allocation (BOFLA) problemwith immobile servers and stochastic demand within the M/M/1/K queue system. The first goal of the research is to develop a mathematical model in which customers and service providers are considered as perspectives. The objectives of the developed model are minimization of the total cost of server provider and minimization of the total time of customers. This model has different real world applications, including locating bank automated teller machines (ATMs), different types of vendor machines, etc. For solving the model, two popular multi-objective evolutionary algorithms (MOEA) of the literature are implemented. The first algorithm is non-dominated sorted genetic algorithm (NSGA-II) and the second one is non-dominated ranked genetic algorithm (NRGA). Moreover, to illustrate the effectiveness of the proposed algorithms, some numerical examples are presented and analyzed statistically. The results indicate that the proposed algorithms provide an effective means to solve the problems. 2014 Elsevier Ltd. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A New Model for Location-Allocation Problem within Queuing Framework

This paper proposes a bi-objective model for the facility location problem under a congestion system. The idea of the model is motivated by applications of locating servers in bank automated teller machines (ATMS), communication networks, and so on. This model can be specifically considered for situations in which fixed service facilities are congested by stochastic demand within queueing frame...

متن کامل

Maximal covering location-allocation problem with M/M/k queuing system and side constraints

  We consider the maximal covering location-allocation problem with multiple servers. The objective is to maximize the population covered, subject to constraints on the number of service centers, total number of servers in all centers, and the average waiting time at each center. Each center operates as an M/M/k queuing system with variable number of servers. The total costs of establishing cen...

متن کامل

Genetic application in a facility location problem with random demand within queuing framework

In many service and industrial applications of the facility location problem, the number of required facilities along with allocation of the customers to the facilities are the two major questions that need to be answered. In this paper, a facility location problem with stochastic customer demand and immobile servers is studied. Two objectives considered in this problem are: (1) minimizing the ...

متن کامل

Developing a New Bi-Objective Functions Model for a Hierarchical Location-Allocation Problem Using the Queuing Theory and Mathematical Programming

In this research, a hierarchical location-allocation problem is modeled in a queue framework. The queue model is considered as M/M/1/k, in which system capacity is finite, equals to k. This is the main contribution of the current research. Customer's enters to the system in order to find the service according to a Poisson. In this problem, the hierarchical location-allocation model is considere...

متن کامل

A Simulated Annealing Algorithm within the Variable Neighbourhood Search Framework to Solve the Capacitated Facility Location-Allocation Problem

In this study, we discuss the capacitated facility location-allocation problem with uncertain parameters in which the uncertainty is characterized by given finite numbers of scenarios. In this model, the objective function minimizes the total expected costs of transportation and opening facilities subject to the robustness constraint. To tackle the problem efficiently and effectively, an effici...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Computers & Industrial Engineering

دوره 74  شماره 

صفحات  -

تاریخ انتشار 2014